Two new zero-dimensional qubit codes from bordered metacirculant construction
نویسندگان
چکیده
We construct qubit stabilizer codes with parameters 〚 81 , 0 20 〛 2 and 94 22 for the first time. use symplectic self-dual additive over F 4 built by modifying adjacency matrices of suitable metacirculant graphs found a randomized search procedure.
منابع مشابه
Minimum construction of two-qubit quantum operations.
Optimal construction of quantum operations is a fundamental problem in the realization of quantum computation. We here introduce a newly discovered quantum gate, B, that can implement any arbitrary two-qubit quantum operation with minimal number of both two- and single-qubit gates. We show this by giving an analytic circuit that implements a generic nonlocal two-qubit operation from just two ap...
متن کاملNew Codes from Old; A New Geometric Construction
We want to provide some background from coding theory and geometry. Let C be a binary linear code of length N, dimension k, and minimum distance at least 4. Let G be a generator matrix for C of size k_N. Then C has length N and dimension N&k. Put N&k=n+1. A basis for C gives a matrix M of size (n+1)_N. Since C has minimum distance at least 4 it follows that the columns of M form a set S of N po...
متن کاملNew extremal binary codes of length 66 as extensions of bordered-double-circulant codes over R2
In this work, we extend two extremal codes of length 64 which were obtained by the authors as bordered-double-circulant codes over R2. Using the extension, we have constructed seven new extremal binary codes of length 66 which were not previously known to exist.
متن کاملConstruction of two SD Codes
SD codes are erasure codes that address the mixed failure mode of current RAID systems. Rather than dedicate entire disks to erasure coding, as done in RAID-5, RAID-6 and Reed-Solomon coding, an SD code dedicates entire disks, plus individual sectors to erasure coding. The code then tolerates combinations of disk and sector errors, rather than solely disk errors. It is been an open problem to c...
متن کاملConstruction of New Completely Regular Z2Z4-linear Codes from Old
A code C is said to be Z2Z4-additive if its coordinates can be partitioned into two subsets X and Y , in such a way that the punctured code of C obtained by removing the coordinates outside X (or, respectively, Y ) is a binary linear code (respectively, a quaternary linear code). The binary image of a Z2Z4-additive code, through the Gray map, is a Z2Z4-linear code, which is not always linear. G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2021.112491